Перевод: с английского на все языки

со всех языков на английский

negated symbol

См. также в других словарях:

  • Negated AND gate — This article is about NAND in the sense of an electronic logic gate. For NAND in the purely logical sense, see Sheffer stroke. For other uses of NAND or Nand, see Nand (disambiguation). INPUT A   B OUTPUT A NAND B 0 0 1 0 1 1 1 0 …   Wikipedia

  • Vinculum (symbol) — A vinculum is a horizontal line placed over a mathematical expression, used to indicate that it is to be considered a group. Vinculum is Latin for bond , fetter , chain , or tie , which is roughly suggestive of some of the uses of the… …   Wikipedia

  • Divisor — divisible redirects here. For divisibility of groups, see Divisible group. For the second operand of a division, see Division (mathematics). For divisors in algebraic geometry, see Divisor (algebraic geometry). For divisibility in the ring theory …   Wikipedia

  • Logic gate — A logic gate is an idealized or physical device implementing a Boolean function, that is, it performs a logical operation on one or more logic inputs and produces a single logic output. Depending on the context, the term may refer to an ideal… …   Wikipedia

  • Method of analytic tableaux — A graphical representation of a partially built propositional tableau In proof theory, the semantic tableau (or truth tree) is a decision procedure for sentential and related logics, and a proof procedure for formulas of first order logic. The… …   Wikipedia

  • Boolean algebra (logic) — For other uses, see Boolean algebra (disambiguation). Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of… …   Wikipedia

  • Prolog — infobox programming language paradigm = Logic programming year = 1972 designer = Alain Colmerauer implementations = BProlog, ECLiPSe, Ciao Prolog, GNU Prolog, Quintus, SICStus, Strawberry, SWI Prolog, YAP Prolog, tuProlog dialects = ISO Prolog,… …   Wikipedia

  • Turing's proof — First published in January 1937 with the title On Computable Numbers, With an Application to the Entscheidungsproblem , Turing s proof was the second proof of the assertion (Alonzo Church proof was first) that some questions are undecidable :… …   Wikipedia

  • List of Ben 10 aliens — This is the list of all aliens of the Omnitrix and Ultimatrix showed in the Ben 10 universe Contents 1 Aliens introduced in Ben 10 1.1 Heatblast 1.2 Wildmutt 1.3 Diamondhead …   Wikipedia

  • Christian communism — Part of the series on Communism …   Wikipedia

  • Typographical Number Theory — (also known as TNT) is a formal axiomatic system describing the natural numbers that appears in Douglas Hofstadter s book Gödel, Escher, Bach. It is an implementation of Peano arithmetic that Hofstadter uses to help explain Gödel s incompleteness …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»